On Spanning Structures in Random Hypergraphs
نویسندگان
چکیده
In this note we adapt a general result of Riordan [Spanning subgraphs of random graphs, Combinatorics, Probability & Computing 9 (2000), no. 2, 125–148] from random graphs to random r-uniform hypergaphs. We also discuss several spanning structures such as cube-hypergraphs, lattices, spheres and Hamilton cycles in hypergraphs.
منابع مشابه
Regularity Lemma for k-uniform hypergraphs
Szemerédi’s Regularity Lemma proved to be a very powerful tool in extremal graph theory with a large number of applications. Chung [Regularity lemmas for hypergraphs and quasi-randomness, Random Structures and Algorithms 2 (1991), 241–252], Frankl and Rödl [The uniformity lemma for hypergraphs, Graphs and Combinatorics 8 (1992), 309–312, Extremal problems on set systems, Random Structures and A...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملRandom hypergraphs and algorithmics
Hypergraphs are structures that can be decomposed or described ; in otherwords they are recursively countable. Here, we get exact and asymptotic enumerationresults on hypergraphs by means of exponential generating functions. The number of hy-pergraph components is bounded, as a generalisation of Wright inequalities for graphs :the proof is a combinatorial understanding of the st...
متن کاملOn Thresholds for the Appearance of 2-cores in Mixed Hypergraphs
We study thresholds for the appearance of a 2-core in random hypergraphs that are a mixture of a constant number of random uniform hypergraphs each with a linear number of edges but with different edge sizes. For the case of two overlapping hypergraphs we give a solution for the optimal (expected) number of edges of each size such that the 2-core threshold for the resulting mixed hypergraph is ...
متن کاملGeneralized loop-erased random walks and approximate reachability
In this paper we extend the loop-erased random walk (LERW) to the directed hypergraph setting. We then generalize Wilson’s algorithm for uniform sampling of spanning trees to directed hypergraphs. In several special cases, this algorithm perfectly samples spanning hypertrees in expected polynomial time. Our main application is to the reachability problem, also known as the directed all-terminal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 49 شماره
صفحات -
تاریخ انتشار 2015